Relationship between the Hosoya polynomial and the hyper-Wiener index
نویسنده
چکیده
The Hosoya polynomial of a graph, H(G, z), has the property that its first derivative, evaluated at z = 1, equals the Wiener index, i.e., W(G) = H’(G, 1). In this paper, an equation is presented that gives the hyper-Wiener index, WW(G), in terms of the first and second derivatives of H(G,z). Also defined here is a hyper-Hosoya polynomial, HH(G,r), which has the property WW(G) = HH’(G, l), analogous to W(G) = H’(G, 1). Uses of higher derivatives of HH(G,z) are proposed, analogous to published uses of higher derivatives of H(G, 2). @ 2002 Elsevier Science Ltd. All rights reserved. Keywords-Hyper-Wiener index, Hosoya polynomial, Chemical graph theory
منابع مشابه
Hosoya polynomials of random benzenoid chains
Let $G$ be a molecular graph with vertex set $V(G)$, $d_G(u, v)$ the topological distance between vertices $u$ and $v$ in $G$. The Hosoya polynomial $H(G, x)$ of $G$ is a polynomial $sumlimits_{{u, v}subseteq V(G)}x^{d_G(u, v)}$ in variable $x$. In this paper, we obtain an explicit analytical expression for the expected value of the Hosoya polynomial of a random benzenoid chain with $n$ hexagon...
متن کاملSome New Results On the Hosoya Polynomial of Graph Operations
The Wiener index is a graph invariant that has found extensive application in chemistry. In addition to that a generating function, which was called the Wiener polynomial, who’s derivate is a q-analog of the Wiener index was defined. In an article, Sagan, Yeh and Zhang in [The Wiener Polynomial of a graph, Int. J. Quantun Chem., 60 (1996), 959969] attained what graph operations do to the Wiene...
متن کاملOn the Steiner hyper-Wiener index of a graph
For a connected graph G and an non-empty set S ⊆ V (G), the Steiner distance dG(S) among the vertices of S is defined as the minimum size among all connected subgraphs whose vertex sets contain S. This concept represents a natural generalization of the concept of classical graph distance. Recently, the Steiner Wiener index of a graph was introduced by replacing the classical graph distance used...
متن کاملHosoya polynomial of zigzag polyhex nanotorus
Abstract: The Hosoya polynomial of a molecular graph G is defined as ∑ ⊆ = ) ( } , { ) , ( ) , ( G V v u v u d G H λ λ , where d(u,v) is the distance between vertices u and v. The first derivative of H(G,λ) at λ = 1 is equal to the Wiener index of G, defined as ∑ ⊆ = ) ( } , { ) , ( ) ( G V v u v u d G W . The second derivative of ) , ( 2 1 λ λ G H at λ = 1 is equal to the hyper-Wiener index, d...
متن کاملComputing the Hosoya Polynomial of Graphs from Primary Subgraphs
The Hosoya polynomial of a graph encompasses many of its metric properties, for instance the Wiener index (alias average distance) and the hyper-Wiener index. An expression is obtained that reduces the computation of the Hosoya polynomial of a graph with cut vertices to the Hosoya polynomial of the so-called primary subgraphs. The main theorem is applied to specific constructions including bouq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Appl. Math. Lett.
دوره 15 شماره
صفحات -
تاریخ انتشار 2002